Deciding 4-colorability of planar triangulations
نویسنده
چکیده
We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently decide if the number is non-zero.
منابع مشابه
3-Colorability of Pseudo-Triangulations
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain classes of plane graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations (a generalization of triangulations) and prove NP-completeness for this class. The complexity status does not change if the maximum face-degree is bounded to fo...
متن کاملInternational Journal of Computational Geometry & Applications
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. 31 However, for certain families of graphs, like triangulations, polynomial time algorithms 32 exist. We consider the family of pseudo-triangulations, which are a generalization of 33 triangulations, and prove NP-completeness for this class. This result also holds if we 34 bound their face degree to four, or...
متن کاملA new proof of 3-colorability of Eulerian triangulations
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short constructive proof of the theorem of Heawood that Eulerian triangulations are 3-colorable.
متن کاملA simple algorithm for 4-coloring 3-colorable planar graphs
Graph coloring for 3-colorable graphs receives very much attention by many researchers in theoretical computer science. Deciding 3-colorability of a graph is a well-known NP-complete problem. So far, the best known polynomial approximation algorithm achieves a factor of O(n0.2072), and there is a strong evidence that there would be no polynomial time algorithm to color 3-colorable graphs using ...
متن کامل2-distance 4-colorability of Planar Subcubic Graphs with Girth at Least 22
The trivial lower bound for the 2-distance chromatic number χ2(G) of any graph G with maximum degree ∆ is ∆+1. It is known that χ2 = ∆+1 if the girth g of G is at least 7 and ∆ is large enough. There are graphs with arbitrarily large ∆ and g ≤ 6 having χ2(G) ≥ ∆ + 2. We prove the 2-distance 4-colorability of planar subcubic graphs with g ≥ 22.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.03962 شماره
صفحات -
تاریخ انتشار 2015